Decay towards the overall-healthy state in SIS epidemics on networks

نویسنده

  • Piet Van Mieghem
چکیده

The decay rate of SIS epidemics on the complete graph KN is computed analytically, based on a new, algebraic method to compute the second largest eigenvalue of a stochastic three-diagonal matrix up to arbitrary precision. The latter problem has been addressed around 1950, mainly via the theory of orthogonal polynomials and probability theory. The accurate determination of the second largest eigenvalue, also called the decay parameter, has been an outstanding problem appearing in general birth-death processes and random walks. Application of our general framework to SIS epidemics shows that the maximum average lifetime of an SIS epidemics in any network with N nodes is not larger (but tight for KN ) than

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Role of subgraphs in epidemics over finite-size networks under the scaled SIS process

In previous work, we developed the scaled SIS process, which models the dynamics of SIS epidemics over networks. With the scaled SIS process, we can consider networks that are finite-sized and of arbitrary topology (i.e., we are not restricted to specific classes of networks). We derived for the scaled SIS process a closed-form expression for the time-asymptotic probability distribution of the ...

متن کامل

A covering-graph approach to epidemics on SIS and SIS-like networks.

In this paper, we introduce a new class of epidemics on networks which we call SI(S/I). SI(S/I) networks differ from SIS networks in allowing an infected individual to become reinfected without first passing to the susceptible state. We use a covering-graph construction to compare SIR, SIS, and SI(S/I) networks. Like the SIR networks that cover them, SI(S/I) networks exhibit infection probabili...

متن کامل

Epidemics in networks with nodal self-infection and the epidemic threshold.

Since the Susceptible-Infected-Susceptible (SIS) epidemic threshold is not precisely defined in spite of its practical importance, the classical SIS epidemic process has been generalized to the ε-SIS model, where a node possesses a self-infection rate ε, in addition to a link infection rate β and a curing rate δ. The exact Markov equations are derived, from which the steady state can be compute...

متن کامل

Resilience of epidemics for SIS model on networks.

Epidemic propagation on complex networks has been widely investigated, mostly with invariant parameters. However, the process of epidemic propagation is not always constant. Epidemics can be affected by various perturbations and may bounce back to its original state, which is considered resilient. Here, we study the resilience of epidemics on networks, by introducing a different infection rate ...

متن کامل

SIS epidemics on Triadic Random Graphs

It has been shown in the past that many real-world networks exhibit community structures and non-trivial clustering which comes with the occurrence of a notable number of triangular connections. Yet the influence of such connection patterns on the dynamics of disease transmission is not fully understood. In order to study their role in the context of Susceptible-Infected-Susceptible (SIS) epide...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1310.3980  شماره 

صفحات  -

تاریخ انتشار 2013